*-Autonomous Categories and Linear Logic

نویسنده

  • Michael Barr
چکیده

The subject of linear logic has recently become very important in theoretical computer science. It is apparent that the ∗-autonomous categories studied at length in [Barr, 1979] are a model for a large fragment of linear logic, although not quite for the whole thing. Since the main reference is out of print and since large parts of that volume are devoted to results highly peripheral to the matter at hand, it seemed reasonable to provide a short introduction to the subject. I include here the formal construction of my student Po-Hsiang Chu that appears as an appendix to that volume. At the time, the formal construction appeared not to have substantial mathematical interest, but it appears to be the most interesting part in the present context. It turns out, for example, that one can in many cases construct models of the full linear logic from Chu’s construction applied to a cartesian closed category. One problem in this subject is that having two very different sources—from linear logic as well as category theory—two very different and essentially inconsistent notations have arisen. Without much hope, I will attempt here to introduce a terminology and notation that draws from both subjects and is as consistent as possible with the two different traditions. To begin with, there is the name ∗-autonomous category that gives the ∗ notation a privileged position. (It also gives librarians fits, which is a good reason to keep using it.) The notation using ⊥ is certainly suggestive, but the name “perp-autonomous” categories is graceless. Thus I will continue to call them ∗-autonomous categories for the time being. The notations 0, 1,+,× for categorical initial object, final object, sum and product are too hallowed by use to even think of changing. Everyone agrees on ⊗ for the tensor. Then there is the dual construction, ∗ In the preparation of this paper, I have been assisted by a grant from the NSERC of Canada. I would also like to thank McGill University for a sabbatical leave and the University of Pennsylvania for a very congenial setting in which to spend that leave.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof nets and free semi-⋆-autonomous categories

In this paper it is proved that Girard’s proof nets for multiplicative linear logic characterise free semi-⋆-autonomous-categories.

متن کامل

Proof nets and semi-⋆-autonomous categories

In this paper it is proved that Girard's proof nets for multiplicative linear logic characterise free semi-⋆-autonomous-categories.

متن کامل

ar X iv : 0 70 9 . 14 21 v 7 [ m at h . L O ] 2 7 Se p 20 07 Coherence in Linear Predicate Logic

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classi...

متن کامل

ar X iv : 0 70 9 . 14 21 v 1 0 [ m at h . L O ] 1 1 O ct 2 00 7 Coherence in Linear Predicate Logic

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classi...

متن کامل

ar X iv : 0 70 9 . 14 21 v 8 [ m at h . L O ] 3 O ct 2 00 7 Coherence in Linear Predicate Logic

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classi...

متن کامل

ar X iv : 0 70 9 . 14 21 v 1 1 [ m at h . L O ] 1 2 N ov 2 00 7 Coherence in Linear Predicate Logic

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 1  شماره 

صفحات  -

تاریخ انتشار 1991